Representative families for matroid intersections, with applications to location, packing, and covering problems
نویسندگان
چکیده
We show algorithms for computing representative families matroid intersections and use them in fixed-parameter set packing, covering, facility location problems with multiple constraints. complement our tractability results by hardness results.
منابع مشابه
On Approximating Four Covering/Packing Problems With Applications to Bioinformatics
In this paper, we consider approximability of four covering/packing type problems which have important applications in computational biology. The problems considered in this paper are the triangle packing problem, the full sibling reconstruction problem under two parsimonious assumptions, the maximum profit coverage problem and the 2-coverage problem. We provide approximation algorithms and ina...
متن کاملMatroid packing and covering with circuits through an element
In 1981, Seymour proved a conjecture of Welsh that, in a connected matroid M , the sum of the maximum number of disjoint circuits and the minimum number of circuits needed to cover M is at most r∗(M) + 1. This paper considers the set Ce(M) of circuits through a fixed element e such that M/e is connected. Let νe(M) be the maximum size of a subset of Ce(M) in which any two distinct members meet o...
متن کاملMatroid intersection, base packing and base covering for infinite matroids
As part of the recent developments in infinite matroid theory, there have been a number of conjectures about how standard theorems of finite matroid theory might extend to the infinite setting. These include base packing, base covering, and matroid intersection and union. We show that several of these conjectures are equivalent, so that each gives a perspective on the same central problem of in...
متن کاملMatroid Intersections, Polymatroid Inequalities, and Related Problems
Given m matroids M1, . . . ,Mm on the common ground set V , it is shown that all maximal subsets of V , independent in the m matroids, can be generated in quasi-polynomial time. More generally, given a system of polymatroid inequalities f1(X) ≥ t1, . . . , fm(X) ≥ tm with quasi-polynomially bounded right hand sides t1, . . . , tm, all minimal feasible solutions X ⊆ V to the system can be genera...
متن کاملA New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing
In this paper we introduce a new general approximation method for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programming (LP) relaxation, leading to a partial integer solution, and the application of a wellbehaved approximation algorithm to complete this solution. If the value of the solution returned by the latter can be ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2021
ISSN: ['1872-6771', '0166-218X']
DOI: https://doi.org/10.1016/j.dam.2021.03.014